Source Coding Algorithms Using the Randomness of a Past Sequence
نویسنده
چکیده
We propose source coding algorithms that use the randomness of a past sequence. The proposed algorithms solve the problems of multi-terminal source coding, rate-distortion source coding, and source coding with partial side information at the decoder. We analyze the encoding rate and the decoding error rate in terms of almost-sure convergence. key words: bits-back coding, lossy source coding, multiterminal source coding, random coding, simulated random coding algorithm, source coding with partial side information at the decoder
منابع مشابه
Two meta-heuristic algorithms for parallel machines scheduling problem with past-sequence-dependent setup times and effects of deterioration and learning
This paper considers identical parallel machines scheduling problem with past-sequence-dependent setup times, deteriorating jobs and learning effects, in which the actual processing time of a job on each machine is given as a function of the processing times of the jobs already processed and its scheduled position on the corresponding machine. In addition, the setup time of a job on each machin...
متن کاملProduction of Recombinant Bacmid Containing the Coding Sequence of Human Hepcidin
Abstract Background and objective: Hepcidin is a cystein-rich antimicrobial peptide, which is secreted by the liver. It fights against wide spectrum of bacteria, viruses and fungi and it is a major regulator of iron homeostasis. Today, scientists have made many efforts on the production of hepcidin. Baculovirus expression system is one of the best eukaryotic expression systems for production of...
متن کاملUsing Information Theory Approach to Randomness Testing
We address the problem of detecting deviations of binary sequence from randomness,which is very important for random number (RNG) and pseudorandom number generators (PRNG). Namely, we consider a null hypothesis H0 that a given bit sequence is generated by Bernoulli source with equal probabilities of 0 and 1 and the alternative hypothesis H1 that the sequence is generated by a stationary and erg...
متن کاملA Method for Low-overhead Secure Network Coding
This paper presents a low-overhead secure network coding scheme. The randomness of chaotic sequence is extremely sensitive to initial conditions characteristic of the program, the combination of the chaotic sequence with the original source message vector to construct a new cryptosystem to achieve the perfect secrecy of the encoding scheme. The program only in the original random network coding...
متن کاملPer Unit Coding for Combined Economic Emission Load Dispatch using Smart Algorithms
This paper proposes per unit coding for combined economic emission load dispatch problem. In the proposed coding, it is possible to apply the percent effects of elements in any number and with high accuracy in objective function. In the proposed per unit coding, each function is transformed into per unit form based on its own maximum value and has a value from 0 to 1. In this paper, particle sw...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- IEICE Transactions
دوره 88-A شماره
صفحات -
تاریخ انتشار 2005